Call graph

Results: 97



#Item
51How is Aliasing Used in Systems Software? Brian Hackett Alex Aiken Computer Science Department Stanford University

How is Aliasing Used in Systems Software? Brian Hackett Alex Aiken Computer Science Department Stanford University

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2006-09-05 19:58:01
52Effective Static Race Detection for Java Mayur Naik Alex Aiken  John Whaley

Effective Static Race Detection for Java Mayur Naik Alex Aiken John Whaley

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2006-03-28 01:09:33
53Reflection Analysis for Java Benjamin Livshits, John Whaley, and Monica S. Lam? Computer Science Department Stanford University Stanford, CA 94305, USA {livshits, jwhaley, lam}@cs.stanford.edu

Reflection Analysis for Java Benjamin Livshits, John Whaley, and Monica S. Lam? Computer Science Department Stanford University Stanford, CA 94305, USA {livshits, jwhaley, lam}@cs.stanford.edu

Add to Reading List

Source URL: suif.stanford.edu

Language: English - Date: 2005-09-07 13:39:43
54LNCSEfficient Context-Sensitive Shape Analysis with Graph Based Heap Models

LNCSEfficient Context-Sensitive Shape Analysis with Graph Based Heap Models

Add to Reading List

Source URL: clip.dia.fi.upm.es

Language: English - Date: 2008-04-28 11:37:29
55LNCSEfficient Context-Sensitive Shape Analysis with Graph Based Heap Models

LNCSEfficient Context-Sensitive Shape Analysis with Graph Based Heap Models

Add to Reading List

Source URL: www.clip.dia.fi.upm.es

Language: English - Date: 2008-04-28 11:37:29
56StackAnalyzer for Am486 StackAnalyzer automatically determines the worst-case stack usage of the tasks in your application. The analysis results of the analyzed binary executable are shown as annotations in the call grap

StackAnalyzer for Am486 StackAnalyzer automatically determines the worst-case stack usage of the tasks in your application. The analysis results of the analyzed binary executable are shown as annotations in the call grap

Add to Reading List

Source URL: www.absint.com

Language: English - Date: 2015-01-19 06:15:30
57A Scaling Context Sensitive Points-to Analysis by Geometric Encoding Xiao Xiao, The Hong Kong University of Science and Technology Charles Zhang, The Hong Kong University of Science and Technology  Context sensitive poin

A Scaling Context Sensitive Points-to Analysis by Geometric Encoding Xiao Xiao, The Hong Kong University of Science and Technology Charles Zhang, The Hong Kong University of Science and Technology Context sensitive poin

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2014-05-26 01:03:11
58A Scaling Context Sensitive Points-to Analysis by Geometric Encoding Xiao Xiao, The Hong Kong University of Science and Technology Charles Zhang, The Hong Kong University of Science and Technology  Context sensitive poin

A Scaling Context Sensitive Points-to Analysis by Geometric Encoding Xiao Xiao, The Hong Kong University of Science and Technology Charles Zhang, The Hong Kong University of Science and Technology Context sensitive poin

Add to Reading List

Source URL: www.cse.ust.hk

Language: English - Date: 2014-05-26 01:03:39
59∗  Statically-Directed Dynamic Automated Test Generation Domagoj Babi´c  Lorenzo Martignoni

∗ Statically-Directed Dynamic Automated Test Generation Domagoj Babi´c Lorenzo Martignoni

Add to Reading List

Source URL: bitblaze.cs.berkeley.edu

Language: English - Date: 2013-03-28 20:19:29
60A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS WILLIAM FLOYD, LESLIE KAY, AND MICHAEL SHAPIRO Abstract. In this paper we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I)

A COVERING-GRAPH APPROACH TO EPIDEMICS ON SIS AND SIS-LIKE NETWORKS WILLIAM FLOYD, LESLIE KAY, AND MICHAEL SHAPIRO Abstract. In this paper we introduce a new class of epidemics on networks which we call SI(S/I). SI(S/I)

Add to Reading List

Source URL: www.math.vt.edu

Language: English - Date: 2011-05-24 09:05:15